The multidimensional cube recurrence
نویسندگان
چکیده
منابع مشابه
The Multidimensional Cube Recurrence
We introduce a recurrence which we term the multidimensional cube recurrence, generalizing the octahedron recurrence studied by Propp, Fomin and Zelevinsky, Speyer, and Fock and Goncharov and the three-dimensional cube recurrence studied by Fomin and Zelevinsky, and Carroll and Speyer. The states of this recurrence are indexed by tilings of a polygon with rhombi, and the variables in the recurr...
متن کاملThe Cube Recurrence
We construct a combinatorial model that is described by the cube recurrence, a nonlinear recurrence relation introduced by Propp, which generates families of Laurent polynomials indexed by points in Z3. In the process, we prove several conjectures of Propp and of Fomin and Zelevinsky, and we obtain a combinatorial interpretation for the terms of Gale-Robinson sequences. We also indicate how the...
متن کاملModeling Multidimensional Databases, Cubes and Cube Operations
On-Line Analytical Processing (OLAP) is a trend in database technology, which was recently introduced and has attracted the interest of a lot of research work. OLAP is based on the multidimensional view of data, supported either by multidimensional databases (MOLAP) or relational engines (ROLAP). In this paper we propose a model for multidimensional databases. Dimensions, dimension hierarchies ...
متن کاملConstrained Cube Lattices for Multidimensional Database Mining
In multidimensional database mining, constrained multidimensional patterns differ from the well-known frequent patterns from both conceptual and log ical points of view because of a common structure and the ability to support various types of constraints. Classical data mining techniques are based on the power set lattice of binary attribute values and, even adapted, are not suitable when addre...
متن کاملCube Lattices: A Framework for Multidimensional Data Mining
Constrained multidimensional patterns differ from the well-known frequent patterns from a conceptual and logical points of view because they are provided with a common structure and support various types of constraints. Classical data mining techniques are based on the power set lattice of binary attributes and, even extended, are not suitable when addressing the discovery of constrained multid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2010
ISSN: 0001-8708
DOI: 10.1016/j.aim.2009.09.004